Entanglement and symmetry in permutation symmetric states

We investigate the relationship between multipartite entanglement and symmetry, focusing on permutation symmetric states. We use the Majorana representation, where these states correspond to points on a sphere. Symmetry of the representation under rotation is equivalent to symmetry of the states under products of local unitaries. The geometric measure of entanglement is thus phrased entirely as a geometric optimisation, and a condition for the equivalence of entanglement measures written in terms of point symmetries. Finally we see that different symmetries of the states correspond to different types of entanglement with respect to SLOCC interconvertibility.Comment: 4 pages, 2 figures. Preliminary versions of some of these results were presented in the QIT 16 workshop in Japan, D. Markham, Proceedings of QIT 16, Japan (2007). Updated to reflect changes for publication: expanded proofs and some new examples give

New Protocols and Lower Bound for Quantum Secret Sharing with Graph States

We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, and Tapp. Parametrized by a graph G and a subset of its vertices A, the protocol consists in: (i) encoding the quantum secret into the corresponding graph state by acting on the qubits in A; (ii) use a classical encoding to ensure the existence of a threshold. These new protocols realize ((k,n)) quantum secret sharing i.e., any set of at least k players among n can reconstruct the quantum secret, whereas any set of less than k players has no information about the secret. In the particular case where the secret is encoded on all the qubits, we explore the values of k for which there exists a graph such that the corresponding protocol realizes a ((k,n)) secret sharing. We show that for any threshold k> n-n^{0.68} there exists a graph allowing a ((k,n)) protocol. On the other hand, we prove that for any k< 79n/156 there is no graph G allowing a ((k,n)) protocol. As a consequence there exists n_0 such that the protocols introduced by Markham and Sanders admit no threshold k when the secret is encoded on all the qubits and n>n_0

Thermal robustness of multipartite entanglement of the 1-D spin 1/2 XY model

We study the robustness of multipartite entanglement of the ground state of the one-dimensional spin 1/2 XY model with a transverse magnetic field in the presence of thermal excitations, by investigating a threshold temperature, below which the thermal state is guaranteed to be entangled. We obtain the threshold temperature based on the geometric measure of entanglement of the ground state. The threshold temperature reflects three characteristic lines in the phase diagram of the correlation function. Our approach reveals a region where multipartite entanglement at zero temperature is high but is thermally fragile, and another region where multipartite entanglement at zero temperature is low but is thermally robust.Comment: Revised, 11 pages, 7 figure

Categorizing High Energy Laser Effects for the Joint Munitions Effectiveness Manual

With the high risk and cost in fielding High Energy Laser (HEL) weapon systems, the development process must include computer simulation models of weapon system performance from the engineering level up to predicting the military worth of employing specific systems in a combat scenario. This research effort focuses on defining how to measure lethality for HEL weapons in an Advanced Tactical Laser (ATL) scenario. In order to create an effective measure for direct comparison between the emerging laser weapon system and existing conventionally delivered weapons, lase time in seconds is presented as a measure comparable to rounds required to cause the desired effect at the target. An examination of input parameters which influence the output power of the laser at the target and thus the required lase time is presented with particular attention being paid to atmospheric conditions and vulnerable bucket size. Results include output tables providing the lase time required for meltthrough of a set of generic truck-type vehicular ground target aimpoints

Worse Than Spam: Issues In Sampling Software Developers

Background: Reaching out to professional software developers is a crucial part of empirical software engineering research. One important method to investigate the state of practice is survey research. As drawing a random sample of professional software developers for a survey is rarely possible, researchers rely on various sampling strategies. Objective: In this paper, we report on our experience with different sampling strategies we employed, highlight ethical issues, and motivate the need to maintain a collection of key demographics about software developers to ease the assessment of the external validity of studies. Method: Our report is based on data from two studies we conducted in the past. Results: Contacting developers over public media proved to be the most effective and efficient sampling strategy. However, we not only describe the perspective of researchers who are interested in reaching goals like a large number of participants or a high response rate, but we also shed light onto ethical implications of different sampling strategies. We present one specific ethical guideline and point to debates in other research communities to start a discussion in the software engineering research community about which sampling strategies should be considered ethical.Comment: 6 pages, 2 figures, Proceedings of the 2016 ACM/IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM 2016), ACM, 201

Evaluation of an intervention for men experiencing angry emotions and violent behaviour

This poster explores the background and methodology of an evaluation of a programme intervention for men (16+ years) that experience angry emotions and/or exhibit violent behaviour. Men who experience feelings of anger and/or that behave in violent ways are limited in where they can go for support. In one locality, men who experience angry emotions or exhibit violent behaviour can self-refer, or can be mandated by court order, to attend a programme of facilitator and group-based peer support designed to reduce angry emotions and incidence of violent behaviour. A ‘realist’ methodology is being used in this evaluation, recognising that any programme intervention is embedded in existing social processes. The research (in progress) utilises qualitative methods of data collection and analysis. Qualitative data is elicited using semi-structured interviews. Interviews with intervention staff and stakeholders have led to the development of ‘programme theories’ about how the intervention works, for whom, in what contexts and why. These programme theories are expressed as Contexts, Mechanisms and Outcomes (CMO) configurations. These CMOc will be tested and refined in future fieldwork with the participants of the 12 week programme intervention

Experimental demonstration of a graph state quantum error-correction code

Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum computing. However, recently a family of entangled resources known as graph states has emerged as a versatile alternative for protecting quantum information. Depending on the graph's structure, errors can be detected and corrected in an efficient way using measurement-based techniques. In this article we report an experimental demonstration of error correction using a graph state code. We have used an all-optical setup to encode quantum information into photons representing a four-qubit graph state. We are able to reliably detect errors and correct against qubit loss. The graph we have realized is setup independent, thus it could be employed in other physical settings. Our results show that graph state codes are a promising approach for achieving scalable quantum information processing

Survival of entanglement in thermal states

We present a general sufficiency condition for the presence of multipartite entanglement in thermal states stemming from the ground state entanglement. The condition is written in terms of the ground state entanglement and the partition function and it gives transition temperatures below which entanglement is guaranteed to survive. It is flexible and can be easily adapted to consider entanglement for different splittings, as well as be weakened to allow easier calculations by approximations. Examples where the condition is calculated are given. These examples allow us to characterize a minimum gapping behavior for the survival of entanglement in the thermodynamic limit. Further, the same technique can be used to find noise thresholds in the generation of useful resource states for one-way quantum computing.Comment: 6 pages, 2 figures. Changes made in line with publication recommendations. Motivation and concequences of result clarified, with the addition of one more example, which applies the result to give noise thresholds for measurement based quantum computing. New author added with new result